Studi Penerapan DWDM-RoF untuk Transmisi Multi Teknologi Akses Nirkabel

ABSTRAKSI: Perkembangan teknologi telekomunikasi secara pesat, termasuk teknologi akses nirkabel seperti Wimax , Wi-Fi, dan WCDMA memungkinkan tiap area mengakomodasi bermacam-macam jenis teknologi tersebut. Multi teknologi yang ada dapat ditransmisikan secara bersama-sama dalam 1 link fiber optik sehingga fiber optik yang memiliki kapasitas yang besar tersebut dapat dimanfaatkan secara optimal. Penggabungan multi teknologi tersebut dilakukan dengan teknik multiplexing-demultiplexing menggunakan DWDM-ROF. Teknik ini harus dilakukan dengan tetap memperhatikan spesifikasi sistem masing-masing agar dapat menghasilkan kinerja yang maksimal.Wimax dan WCDMA dengan teknik DWDM-RoF dengan melibatkan gangguan-gangguan yang terjadi pada proses transmisi, yaitu noise RIN pada laser, loss pada multiplexer dan demultiplexer optik, atenuasi, dispersi, scattering dan four wave mixing pada link fiber optik. Selain itu, juga memperhitungkan noise yang mengganggu pada photodetektor di penerima, yaitu surface dark current, leakage dark current dan multiplication noise.Hasil simulasi menunjukkan bahwa panjang fiber optik 40 km – 100 km mempengaruhi Eb/N0 yang dibutuhkan untuk mencapai BER tertentu. Makin panjang fiber, makin besar Eb/N0 yang dibutuhkan. Pada jarak 100 km, performansi WiMax menurun secara drastis dibandingkan WCDMA dan Wi-Fi. Performansi sistem secara keseluruhan dibatasi oleh performansi sistem WiMax. Untuk pengujian terhadap teknologi WCDMA, WIFI dan WIMAX dengan DWDM dengan 3 panjang gelombang dan non DWDM memberikan perbedaan Eb/N0 yang tidak signifikan untuk mencapai BER tertentu. Dari simulasi juga diketahui bahwa gangguan scattering memberikan pengaruh yang paling besar bagi WCDMA, Wi-Fi dan WiMax jika dibandingkan pengaruh lainnya pada fiber optik.Kata Kunci : DWDM, RoF, WCDMA, Wi-Fi, WiMax, Absorpsi, dispersi, scattering, FWM, akses nirkabel.ABSTRACT: Telecommunications technology such as WiMax, WCDMA and Wi-Fi has a rapid development. It is possible that every area accommodates some kind of technology. Technologies be able to transmit together in a single fiber optic, so that fiber optic with the big capacity can be used optimally. Technologies are bundled with multiplexing-demultiplexing technique. Notice that system spesification must be good in order to produce the maximal performance.In this Thesis, simulation and modelling is done to transmit 3 kind of wireless access technologies, i. e WCDMA, Wi-Fi and WiMax with DWDM technique. The simulation including interference from RIN (on laser), multiplexer and demultiplexer losses, absorption, scattering, and four wave mixing in fiber optik link. Beside that, it is including loss and noise in photodetector, such as surfave dark current, leakage dark current and multiplication noise.The simulation result show that fiber optic length influencing Eb/N0 to reach certain value of BER. Longer fiber optic, it mean bigger Eb/N0 needed. In fiber optic length 100 km, performance of WiMax have a significant decrease compare to WCDMA and Wi-Fi. Overall system performance limited by WiMax performance. Experiment about WCDMA, Wi-Fi and WiMax with DWDM and non DWDM technique show that the both performance are not significantly different. And the other result show that scattering give a biggest influence to WCDMA, Wi-Fi and Wimax systems, compare to other interfere in fiber optic.Keyword: DWDM, RoF, WCDMA, Wi-Fi, WiMax, Absorption, dispersion, scattering, FWM, wireless access

Caching on Named Data Network: a Survey and Future Research

The IP-based system cause inefficient content delivery process. This inefficiency was attempted to be solved with the Content Distribution Network. A replica server is located in a particular location, usually on the edge router that is closest to the user. The user’s request will be served from that replica server. However, caching on Content Distribution Network is inflexible. This system is difficult to support mobility and conditions of dynamic content demand from consumers. We need to shift the paradigm to content-centric. In Named Data Network, data can be placed on the content store on routersthat are closest to the consumer. Caching on Named Data Network must be able to store content dynamically. It should be selectively select content that is eligible to be stored or deleted from the content storage based on certain considerations, e.g. the popularity of content in the local area. This survey paper explains the development of caching techniques on Named Data Network that are classified into main points. The brief explanation of advantages and disadvantages are presented to make it easy to understand. Finally, proposed the open challenge related to the caching mechanism to improve NDN performance

MULTIMEDIA E-LEARNING UNTUK MENUNJANG PEMBELAJARAN MATA KULIAH JARINGAN KOMPUTER DAN DATA DI UNIVERSITAS TELKOM

Computer and Data Networks is one of subject in Faculty of Electrical Engineering, Telkom University, that is still using the learning method by face-to-face between lecturer and students. The student’s problem is difficult to understand how computers and other communication devices can communicate each other, and in fact it is lack of visual aid. This paper presents multimedia e-learning that support for studying about Communication Protocol and IPv4 modules. E-learning multimedia content created in the form of video tutorials and animation using flash. In modules are also equipped with exercises to explore student’s understanding. Analysis shows that the e-learning modules provide added value to the students to increase their knowledge and improve the number of graduation

Performance Analysis of CSI:T Routing in a Delay Tolerant Networks

Delay Tolerant Network (DTN) is a network that allows nodes to move dynamically and doesn’t always provide for end-to-end connection. The dynamically of nodes make the movement of the nodes becomes important. The movement model of nodes will record their behavior and this could be utilized to develop a new routing protocol in DTN. One of the DTN routing protocol that utilize it is CSI: T routing. CSI: T routing viewed a node based on their behavioral profile which is represent the mobility preference. Our study is measure the performance of CSI: T in terms of delivery probability, overhead ratio, and average latency by changing the buffer capacity, packet lifetime, and number of nodes. We used Opportunistic Network Environment (ONE) Simulator for the simulate the real-life scenario of a college-routines

ANALISIS PERFORMANSI PROTOCOL FOR UNIFIED MULTICASTING TROUGH ANNOUNCEMENT (PUMA) PADA MANET MENGGUNAKAN NETWORK SIMULATOR 2

Ad hoc network is a wireless network system that does not require a fixed network infrastructure. ONE of the type of Ad hoc networks is MANET or mobile Ad hoc network. MANET is a distributed system consisting of several mobile nodes that can communicate each other trough radio communication system in a certain transmission range. Node movement on MANET causes the proccess of creating and terminating link among some nodes becomes unstable. Therefore, we need a routing protocol that can manage path selection of data transmission on MANET. In this study will be analyzed ONE of the MANET routing protocol called protocol for unified multicasting trough announcement (PUMA) by using network Simulator 2. The scenarios of this research are testing the variation number of nodes and the time of simulations. While the parameters analysis in this research are packet delivery ratio (PDR) and throughput. The result of this analysis shows that, the increasing number of nodes will make the increasing value of throughput. While toward the PDR value, increasing the number of nodes will make the decreasing value of pdr.Jaringan Ad hoc merupakan suatu sistem jaringan wireless yang tidak membutuhkan infrastruktur jaringan tetap. Salah satu jenis jaringan Ad hoc adalah MANET atau mobile Ad hoc network. MANET merupakan sistem terdistribusi yang terdiri dari sekelompok mobile node yang dapat saling berkomunikasi satu sama lain melalui sistem komunikasi radio dalam jangkauan transmisi tertentu. Pergerakan node pada manet menyebabkan terjadinya pembangunan dan pemutusan link antar node menjadi tidak stabil. Oleh karena itu, dibutuhkan suatu protokol routing yang dapat mengatur pemilihan jalur pengiriman data pada jaringan MANET. Pada penelitian ini, dianalisis salah satu protokol routing MANET yaitu protocol for unified multicasting trough announcement (PUMA) menggunakan network Simulator 2. Skenario yang dilakukan pada penelitian ini diantaranya pengujian dari variasi jumlah node dan waktu simulasi yang dijalankan. Sedangkan parameter yang diukur pada penelitian ini yaitu packet delivery ratio (PDR) dan throughput. Hasil analisis menunjukan bahwa, semakin bertambahnya jumlah node, semakin meningkat pula nilai throughputnya. Sedangkan terhadap nilai PDR, penambahan jumlah node menunjukan hasil PDR yang relatif menurun

Analisis Performansi Modifikasi Binary Spray and Wait menggunakan Prophet pada DTN

Delay Tolerant Network (DTN) enabling communication in an environment where there may be no link end-to-end, communication opportunities come and go and the intervals can be extremely long and even previously unknown. There are some Routing Protocol on DTN, including Binary Spray and Wait is a development of Spray and Wait, and PROPHET.  Research discuss about modification of Binary Spray and Wait in spray phase using delivery predictability in PROPHET. Simulation used ONE (Opportunistic Network Environtment) Simulator and analyze Delivery Probability, Overhead Ratio, Buffer Time, Average Latency and Average Remaining Energy in Shortest Path Map Based dan Random Way Point movement. Based on observation, the resulting modification of Binary Spray and Wait improve performance and buffer time average latency compared with Binary Spray and Wait, but slightly lower probability delivery and improving overhead ratio.Keywords : Delay Tolerant Network, Spray and Wait, PROPHET, Shortest Path Map Based, Random Way Point.AbstrakDelay Tolerant Network (DTN) memungkinkan komunikasi dalam lingkungan di mana mungkin tidak ada jalur end-to-end, peluang komunikasi datang dan pergi dan intervalnya bisa sangat panjang dan bahkan tidak diketahui sebelumnya. Ada beberapa Routing Protocol pada DTN, diantaranya Binary Spray and Wait yang merupakan pengembangan dari Spray and Wait, dan PROPHET. Penelitian ini membahas tentang modifikasi Binary Spray and Wait pada tahap spray menggunakan teknik delivery predictability yang ada di PROPHET. Simulasi menggunakan ONE (Opportunistic Network Environtment) Simulator dan menganalisa Delivery Probability, Overhead Ratio, Buffer Time, Average Latency dan Average Remaining Energy pada pergerakan node Shortest Path Map Based dan Random Way Point. Berdasarkan pengamatan, dihasilkan Modifikasi Binary Spray and Wait meningkatkan performansi average latency dan buffer time dibanding dengan Binary Spray and Wait, namun menurunkan sedikit delivery probability dan memperbesar overhead ratio.Kata Kunci : Delay Tolerant Network, Spray and Wait, PROPHET, Shortest Path Map Based, Random Way Point

A Content Poisoning Attack Detection and Prevention System in Vehicular Named Data Networking

Named data networking (NDN) is gaining momentum in vehicular ad hoc networks (VANETs) thanks to its robust network architecture. However, vehicular NDN (VNDN) faces numerous challenges, including security, privacy, routing, and caching. Specifically, the attackers can jeopardize vehicles’ cache memory with a Content Poisoning Attack (CPA). The CPA is the most difficult to identify because the attacker disseminates malicious content with a valid name. In addition, NDN employs request–response-based content dissemination, which is inefficient in supporting push-based content forwarding in VANET. Meanwhile, VNDN lacks a secure reputation management system. To this end, our contribution is three-fold. We initially propose a threshold-based content caching mechanism for CPA detection and prevention. This mechanism allows or rejects host vehicles to serve content based on their reputation. Secondly, we incorporate a blockchain system that ensures the privacy of every vehicle at roadside units (RSUs). Finally, we extend the scope of NDN from pull-based content retrieval to push-based content dissemination. The experimental evaluation results reveal that our proposed CPA detection mechanism achieves a 100% accuracy in identifying and preventing attackers. The attacker vehicles achieved a 0% cache hit ratio in our proposed mechanism. On the other hand, our blockchain results identified tempered blocks with 100% accuracy and prevented them from storing in the blockchain network. Thus, our proposed solution can identify and prevent CPA with 100% accuracy and effectively filters out tempered blocks. Our proposed research contribution enables the vehicles to store and serve trusted content in VNDN

Performance Analysis of Cache Based on Popularity and Class in Named Data Network

The communication network is growing with some unique characteristics, such as consumers repeatedly request the same content to the server, similarity in local demand trend, and dynamic changes to requests within a specific period. Therefore, a different network paradigm is needed to replace the IP network, namely Named Data Network (NDN). The content store, which acts as a crucial component in the NDN nodes is a limited resource. In addition, a cache mechanism is needed to optimize the router’s content store by exploiting the different content services characters in the network. This paper proposes a new caching algorithm called Cache Based on Popularity and Class (CAPIC) with dynamic mechanism, and the detail explanation about the static method also presented. The goal of Static-CAPIC was to enhance the total cache hit ratio on the network by pre-determining the cache proportion for each content class. However, this technique is not appropriate to control the cache hit ratio for priority class. Therefore, the Dynamic-CAPIC is used to provide flexibility to change the cache proportion based on the frequency of requests in real-time. The formula involves considering the consumers’ request all the time. It gives a higher cache hit ratio for the priority content class. This method outperforms Static-CAPIC, and the LCD+sharing scheme in the total network cache hit ratio parameter and channels it to the priority class

Analisis Performansi Algoritma Routing First Contact dengan Stationary Relay Node pada Delay Tolerant Network

ABSTRAKAlgoritma routing pada jaringan klasik dapat berjalan jika hubungan end-to-end selalu ada.Algoritma routing ini bekerja dengan menggunakan informasi mengenai seluruh jalur yang tersedia.Untuk itu, pada jaringan dengan kondisi ekstrim seperti ini diperlukan algoritma routing yang sesuai.Salah satu algoritma routing yang dapat dijalankan pada Delay Tolerant Network (DTN) adalah First Contact.Algoritma iniakanmelakukan penggandaan pesan yang dibawanyauntuk kemudian diberikan kepada node lainnya yang pertama kali ditemui.Dalam penelitian ini ditambahkan stationary relay node untuk meningkatkan delivery probability.Dengan penambahan stationary relay node diperoleh peningkatan delivery probability 2 hingga 6% dibandingkan dengan jaringan tanpa stationary relay node. Parameter overhead ratio meningkat  sebesar 7-18% dibandingkan jaringan tanpa Stationary relay node. Algoritma First Contact dengan tambahan Stationary relay nodejuga memberikan tambahan average latency, 118 – 171 detik.Nilaiini berbanding lurus dengan jumlah mobile node DTN yang ada pada area tersebut.Kata kunci: Delay Tolerant Network, first contact,Stationaryrelaynode, routing algorithm, delivery probability, overhead ratio, average latency.ABSTRACTClassical routing algorithms only works if there is end to end connection.This algorithms uses the information about every available path, and then choose the best path related to spesific metric.. For the networks with the extreme condition, it is needed the suitable routing alorithms. One of the routing algorithms that is able to be applicated in Delay Tolerant Network (DTN) is First Contact. This algorithm will make a single copy message and then forward it to the first encountered node. In this research, the stationaryrelaynodes were added to improve delivery probability. The effect of adding stationary relay node is increasing the delivery probability about 2-6%, compared to networks without stationary relay node. The overhead ratio increased about  7-18% compared to networks without stationary relay node. First Contact algorithm with stationary relay node gives bigger average latency, 118 – 171 second. This value is directly proportional to the number of mobile DTN nodes that exist in the area.Keywords: Delay Tolerant Network, first contact, Stationaryrelaynode, routing algorithm, delivery probability, overhead ratio, average latency..

Jaringan Komputer dan Data

Buku ini disusun sebagai referensi bagi pembaca, khususnya mahasiswa untuk mendalami jaringan komputer. Buku ini berisi definisi jaringan komputer; tren perkembangan jaringan; protokol jaringan; meliputi OSI dan TCP/IP; fungsi layer fisik, yaitu pengodean dan sinkronisasi; fungsi layer dalam data link meliputi deteksi dan koreksi kesalahan serta pengamatan IP. Pembahasan yang lengkap menjadikan buku ini juga sangat cocok dijadikan referensi penulisan suatu karya ilmiah